A low-complexity discrete radiosity method

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Low Complexity Discrete Radiosity Method

Rather than using Monte Carlo sampling techniques or patch projections to compute radiosity, it is possible to use a discretization of a scene into voxels and perform some discrete geometry calculus to quickly compute visibility information. In such a framework , the radiosity method may be as precise as a patch-based radiosity using hemicube computation for form-factors, but it lowers the over...

متن کامل

A Discrete Radiosity Method

We present a completely new principle of computation of radiosity values in a 3D scene. The method is based on a voxel approximation of the objects, and all occlusion calculations involve only integer arithmetics operation. The method is proved to converge. Some experimental results are presented.

متن کامل

Parallelization of a Discrete Radiosity Method

In this paper we present three different parallelizations of a discrete radiosity method achieved on a cluster of workstations. This radiosity method has lower complexity when compared with most of the radiosity algorithms and is based on the discretization of surfaces into voxels and not into patches. The first two parallelizations distribute the tasks. They present good performance in time bu...

متن کامل

Parallelization of a Discrete Radiosity Method Using Scene Division

We present in this article a parallelization of a discrete radiosity method, based on scene division and achieved on a cluster of workstations. This method is based on discretization of surfaces into voxels and not into patches like most of the radiosity methods do. Voxels are stocked into visibility lists representing the space partition into discrete lines and allowing mutually visible neighb...

متن کامل

One Method to Reduce Complexity of Matrix Radiosity Algorithm

The given report is devoted to an original approach for reducing computational cost (memory and time) of the matrix radiosity algorithm. Such investigations are still quite actual because the algorithm requires significant amounts of memory and time. From other side it began to be applied in practice due to increasing power and memory of modern desktop computers. Recent efforts of computer grap...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computers & Graphics

سال: 2006

ISSN: 0097-8493

DOI: 10.1016/j.cag.2005.10.008